Comparison of eight evolutionary crossover operators for the vehicle routing problem
نویسندگان
چکیده
This paper deals with evolutionary algorithms for solving the vehicle routing problem. More precisely, the paper is concerned with eight evolutionary crossover operators, which have originally been designed for the traveling salesman problem but can also be used for vehicle routing. The considered crossovers are tested on a set of well known benchmark problem instances. The obtained experimental results clearly show that the behavior and relative ranking of the operators within the vehicle routing environment is different than within the traveling salesman environment. AMS subject classifications: 90C27, 90C35, 90C59, 68W40
منابع مشابه
A novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملA Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Single-sided Time Window Setting
Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملEvolutionary Approach for Energy Minimizing Vehicle Routing Problem with Time Windows and Customers’ Priority
A new model and solution for the energy minimizing vehicle routing problem with time windows (EVRPTW) and customers’ priority is presented in this paper. In this paper unlike prior attempts to minimize cost by minimizing overall traveling distance, the model also incorporates energy minimizing which meets the latest requirements of green logistics. This paper includes the vehicles load as an ad...
متن کاملCrossover and Diversity: A Study about GVR
Genetic Vehicle Representation (GVR) is a two level representational scheme, designed to deal in an effective way with all the information needed by candidate solutions, for the Vehicle Routing Problem (VRP). In this paper, we present an analysis on the influence of two crossover operators in the algorithm performance. A first study on diversity is also presented, regarding the issues of divers...
متن کامل